Hardness amplification within NP

Hardness Ampli ation Within NP

CS 880: Advanced Complexity Theory Final Project: Hardness Amplification within NP

We survey the current status of the problem of Hardness amplification within NP, reviewing known results and evaluating various approaches for improving on them. We also prove that under some stronger assumptions, we can amplify the hardness to (12 − 1/2).

CS 880 : Advanced Complexity Theory 2 / 29 / 2008 Lecture 15 : Hardness Amplification within NP

In the last lecture, we introduced the general idea of boosting the hardness of a function by taking k independent copies of the function and aggregating them using another function h. We obtained the following result:

Uniform Hardness Amplification in NP via Monotone Codes

We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone errorcorrecting codes, and show that hardness amplification for NP is essentially equivalent to constructing efficiently locally encodable and locally list-decodable monotone codes. The previous hardness amplification resul...

NP-Hardness of Cache Mapping

Plncessors sllch os the Iritel StrorigARM SA-1110 orid tlir Intel XScole provide ,fle.riDI~. contrnl oller tlie corhe riinnogen7ent to orhieve better roche z~tili:oriori. Pl-ogronis can specih tlie cache ~iinpying policy for each virtr~ol poge, i.e. niopping it to the mnirz cache, the riiini-coche, or neithel: For the latter cose, the pnge is mnrked ns nonr~cheoble. 111 tliis popel; we liiodel ...